On Chebyshev polynomials and maximal curves
نویسندگان
چکیده
منابع مشابه
Curves Defined by Chebyshev Polynomials
Working over a field k of characteristic zero, this paper studies line embeddings of the form φ = (Ti, Tj , Tk) : A → A, where Tn denotes the degree n Chebyshev polynomial of the first kind. In Section 4, it is shown that (1) φ is an embedding if and only if the pairwise greatest common divisor of i, j, k is 1, and (2) for a fixed pair i, j of relatively prime positive integers, the embeddings ...
متن کاملDrawing Parametric Curves Using Chebyshev Polynomials
Polynomial parametric curves are powerful and popular modeling tools in Computer Graphics and Computer Aided Design. There are two requirements that are placed on techniques for displaying these curves. In interactive applications, such as drawing and design, the need is for a fast display. In non interactive applications, such as typeset ting, the need is for accuracy (or at least the appearan...
متن کاملA note on superspecial and maximal curves
In this note we review a simple criterion, due to Ekedahl, for superspecial curves defined over finite fields.Using this we generalize and give some simple proofs for some well-known superspecial curves.
متن کاملOn integer Chebyshev polynomials
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...
متن کاملFast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly, we employ an adaptation of approximate implicitization to envelope computation. Moreover, by utilizing an orthogonal basis in the construction process, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1999
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-90-4-301-311